Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
نویسندگان
چکیده
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and pushdown processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operational semantics for the sequential composition operator in the context of intermediate termination. With the revised operational semantics, we eliminate transparency, allowing us to establish a close correspondence between context-free processes and pushdown processes. Moreover, we prove the reactive Turing powerfulness of TCP with iteration and nesting with the revised operational semantics for sequential composition.
منابع مشابه
Sequential Composition in the Presence of Intermediate Termination
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and push-down processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operation...
متن کاملThe hidden computation steps of Turbo ASMs
Turbo Abstract State Machines are ASMs with parallel and sequential composition and possibly recursive submachine calls. Turbo ASMs are viewed as black-boxes that can combine arbitrary many steps of one or more submachines into one big step. The intermediate steps of a turbo ASM are not observable from outside. It is not even clear what exactly the intermediate steps are, because the semantics ...
متن کاملOPTIMAL DESIGN OF DOUBLE LAYER GRIDS CONSIDERING NONLINEAR BEHAVIOUR BY SEQUENTIAL GREY WOLF ALGORITHM
The present paper tackles the optimization problem of double layer grids considering nonlinear behaviour. In this paper, an efficient optimization algorithm is proposed to achieve the optimization task based on the newly developed grey wolf algorithm (GWA) termed as sequential GWA (SGWA). In the framework of SGWA, a sequence of optimization processe...
متن کاملProving Termination of Sequential Reduction Relation using Tree Automata
The sequential reduction relation is a speciic rewrite relation, rewriting terms by separate normalisations w.r.t. several systems, or modules. When considering simple combinations of systems, like disjoint or con-structor sharing, termination (or weak termination) of each system implies termination of the sequential reduction relation. In the case of more complex combinations, like hierarchica...
متن کاملInterval network data envelopment analysis model for classification of investment companies in the presence of uncertain data
The main purpose of this paper is to propose an approach for performance measurement, classification and ranking the investment companies (ICs) by considering internal structure and uncertainty. In order to reach this goal, the interval network data envelopment analysis (INDEA) models are extended. This model is capable to model two-stage efficiency with intermediate measures i...
متن کامل